Credo: Thwarting collusion attacks in peer-to-peer content distribution systems

نویسندگان

  • Nguyen Tran
  • Jinyang Li
  • Lakshminarayanan Subramanian
چکیده

Current peer-to-peer content distribution networks do not effectively encourage users to act as seeders; this results in suboptimal behavior as many users disconnect immediately upon retrieving files. Reputation systems can incentivize users to remain active and seed files. Unfortunately, existing reputation systems are unsatisfactory – they do not accurately capture a node’s net contribution in the face of Sybil and collusion attacks. In this paper, we present Credo, a robust credit-based reputation system with a novel reputation algorithm to compute node reputation based on the set of uploads reported by peer nodes. Credo’s algorithm employs two novel techniques: credit diversity and modeling good behavior, which can limit the reputation gains of colluding adversaries effectively. Using simulations, we show that Credo is resilient against attack and provides an effective incentive, allowing nodes with more upload contributions to experience faster downloads. We have incorporated Credo in the Azureus BitTorrent client and show that overall system performance is significantly improved in the PlanetLab deployment. Additionally we show that our implementation scales well and is capable of handling systems with large numbers of nodes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Making Contribution-Aware P2P Systems Robust to Collusion Attacks Using Bandwidth Puzzles

Many peer-to-peer (P2P) content-distribution systems reward a peer based on its contribution to the system, specifically the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowledge, an open problem; e.g., in a simple form of “ballot stuffing” attack, a group of colluding attackers can earn rewards by claiming to have served content to one anot...

متن کامل

Identifying Collusion Attack in P2P Trust and Reputation Systems

Internet became today a medium of sharing large amount of data among different nodes situated anywhere in the world. Due to its fairly open nature Peer to Peer applications gain-ing popularity in sharing of large data rather then conventional client-server systems. Many P2P applications has been designed for the purpose of content distribution over Internet and most of them are based on decentr...

متن کامل

PSUM: Peer-to-peer multimedia content distribution using collusion-resistant fingerprinting

The use of peer-to-peer (P2P) networks for multimedia distribution has spread out globally in recent years. The mass popularity is primarily driven by cost-effective distribution of content, also giving rise to piracy. An end user (buyer/peer) of a P2P content distribution system does not want to reveal his/her identity during a transaction with a content owner (merchant), whereas the merchant ...

متن کامل

Making Contribution-Aware Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles

Many peer-assisted content-distribution systems reward a peer based on the amount of datathat this peer serves to others. However, validating that a peer did so is, to our knowledge, anopen problem; e.g., a group of colluding attackers can earn rewards by claiming to have servedcontent to one another, when they have not. We propose a bandwidth puzzle mechanism tomake contributio...

متن کامل

A Genetic Programming-based trust model for P2P Networks

Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011